منابع مشابه
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question for intersections of such automata is fundamental. This also ha...
متن کاملJ . Goubault − Larrecq and K . N . Verma Alternating Two − Way AC − Tree Automata Research
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols, some of them with a unit (AC1). This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question for intersections of such autom...
متن کاملMonotone AC-Tree Automata
We consider several questions about monotone AC-tree automata, a class of equational tree automata [21] whose transition rules correspond to rules in Kuroda normal form of context-sensitive grammars. Whereas it is known that this class has a decision procedure to determine if a given monotone AC-tree automaton accepts no term [23], other decidability and complexity results have not been well-in...
متن کاملRegularly Extended Two-Way Nondeterministic Tree Automata
We establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is th...
متن کاملTwo-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties
We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM ), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU ). We show that the one-way automata for all these theories are closed under union and intersection, and emptiness is decidable. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.12.006